Discrete approximation of quantum stochastic models
نویسندگان
چکیده
منابع مشابه
Discrete approximation of quantum stochastic models
We develop a general technique for proving convergence of repeated quantum interactions to the solution of a quantum stochastic differential equation. The wide applicability of the method is illustrated in a variety of examples. Our main theorem, which is based on the Trotter–Kato theorem, is not restricted to a specific noise model and does not require boundedness of the limit coefficients. © ...
متن کاملDiscrete approximation of stochastic differential equations
It is shown how stochastic Itô-Taylor schemes for stochastic ordinary differential equations can be embedded into standard concepts of consistency, stability and convergence. An appropriate choice of function spaces and norms, in particular a stochastic generalization of Spijker’s norm (1968), leads to two-sided estimates for the strong error of convergence under the usual assumptions.
متن کاملDiscrete Stochastic Models Fortraffic
We investigate a probabilistic cellular automaton model which has been introduced recently. This model describes single-lane traac ow on a ring and generalizes the asymmetric exclusion process models. We study the equilibrium properties and calculate the so-called fundamental diagrams ((ow vs. density) for parallel dynamics. This is done numerically by computer simulations of the model and by m...
متن کاملPerturbed discrete time stochastic models
In this thesis, nonlinearly perturbed stochastic models in discrete time are considered. We give algorithms for construction of asymptotic expansions with respect to the perturbation parameter for various quantities of interest. In particular, asymptotic expansions are given for solutions of renewal equations, quasi-stationary distributions for semi-Markov processes, and ruin probabilities for ...
متن کاملStochastic Approximation for Estimation of Biological Models
Stochastic approximation for estimation (SAE) is a class of optimisation algorithms, which computes, to an approximation, the gradient and/or the Hessian of the objective function by varying all the elements of the parameter vector simultaneously and, therefore, requires only a few objective function evaluations to obtain first or second-order information. Consequently, these algorithms are par...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Physics
سال: 2008
ISSN: 0022-2488,1089-7658
DOI: 10.1063/1.3001109